On the matrix harmonic mean

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Arithmetic - Harmonic Mean

Consider two sequences generated by ",,+ i Mi"„<hn)hn*\ M'i"„+X,b„), where the a„ and b„ are positive and M and M' are means. The paper discusses the nine processes which arise by restricting the choice of M and M' to the arithmetic, geometric and harmonic means, one case being that used by Archimedes to estimate it. Most of the paper is devoted to the arithmetic-harmonic mean, whose limit is e...

متن کامل

Harmonic Mean Labeling on Double Triangular Snakes

A graph G= (V,E) with p vertices and q edges is called a Harmonic mean graph if it is possible to label the vertices xV with distinct labels f(x) from 1,2,....,q+1 in such a way that when each edge e=uv is labeled with f(uv)= ( ) ( ) ( ) ( ) (or) ( ) ( ) ( ) ( ) , then the edge labels are distinct. In this case, f is called Harmonic mean labeling of G. In this paper we prove that Double Triang...

متن کامل

The matrix geometric mean

An attractive candidate for the geometric mean of m positive definite matrices A1, . . . , Am is their Riemannian barycentre G. One of its important properties, monotonicity in the m arguments, has been established recently by J. Lawson and Y. Lim. We give a much simpler proof of this result, and prove some other inequalities. One of these says that, for every unitarily invariant norm, |||G||| ...

متن کامل

Some More Inequalities for Arithmetic Mean, Harmonic Mean and Variance

We derive bounds on the variance of a random variable in terms of its arithmetic and harmonic means. Both discrete and continuous cases are considered, and an operator version is obtained. Some refinements of the Kantorovich inequality are obtained. Bounds for the largest and smallest eigenvalues of a positive definite matrix are also obtained.

متن کامل

On the harmonic index of bicyclic graphs

The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Inequalities

سال: 2018

ISSN: 1846-579X

DOI: 10.7153/jmi-2018-12-68